- provably unsolvable
- доказуемо неразрешимый (о множестве задач, для которых не существует никаких алгоритмов решения)
English-Russian dictionary of computer science and programming. 2013.
provably unsolvable
Смотреть что такое "provably unsolvable" в других словарях:
unsolvable — adjective a) Not solvable. b) Provably not solvable … Wiktionary
Mathematical problem — A mathematical problem is a problem that is amenable to being represented, analyzed, and possibly solved, with the methods of mathematics. This can be a real world problem, such as computing the orbits of the planets in the solar system, or a… … Wikipedia
Scottish Café — The Scottish Café ( pl. Kawiarnia Szkocka; ua. Шотландська кав ярня, ru. Шотландское кафе) was the café in Lwów (now Lviv ) where, in the 1930s and 1940s, Polish mathematicians from the Lwów School of Mathematics met and spent their afternoons… … Wikipedia
Gödel's incompleteness theorems — In mathematical logic, Gödel s incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of… … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Mathematical logic — (also known as symbolic logic) is a subfield of mathematics with close connections to foundations of mathematics, theoretical computer science and philosophical logic.[1] The field includes both the mathematical study of logic and the… … Wikipedia
David Hilbert — Hilbert redirects here. For other uses, see Hilbert (disambiguation). David Hilbert David Hilbert (1912) Born … Wikipedia
Equation solving — In mathematics, to solve an equation is to find what values (numbers, functions, sets, etc.) fulfill a condition stated in the form of an equation (two expressions related by equality). These expressions contain one or more unknowns, which are… … Wikipedia
Busy beaver — In computability theory, a busy beaver (from the colloquial expression for an industrious person) is a Turing machine that attains the maximum operational busyness (such as measured by the number of steps performed, or the number of nonblank… … Wikipedia
Pseudomathematics — is a form of mathematics like activity that does not work within the framework, definitions, rules, or rigor of formal mathematical models. While any given pseudomathematical approach may work within some of these boundaries, for instance, by… … Wikipedia
